package 贪心算法;

import java.util.Arrays;

public class test {
    public static void main(String[] args) {
        分发糖果.Solution solution = new 分发糖果.Solution();
        int[] nums = {1,0,2};
        int candy = solution.candy(nums);
        System.out.println(candy);

        柠檬水找零.Solution solution1 = new 柠檬水找零.Solution();
        int[] nums2 = {5,5,10,10,20};
        boolean enough = solution1.isEnough(nums2);
        System.out.println(enough);

        根据身高重建队列.Solution solution2 = new 根据身高重建队列.Solution();
        int[][] nums3 = {{7,0},{4,4},{7,1},{5,0},{6,1},{5,2}};
        int[][] ints = solution2.reconstructQueue(nums3);
        System.out.println(Arrays.deepToString(ints));
    }
}
